Using Non-interactive Proofs to Achieve Independence Eeciently and Securely
نویسنده
چکیده
Independence or simultaneous broadcast is a fundamental tool to achieve security in fault tolerant distributed computing. It allows n players to commit to independently chosen values. In this paper we present a constant round protocol to perform this task. Previous solutions were all O(log n) rounds. In the process we develop a new and stronger formal deenition from this problem. As an example of the importance of independence in distributed protocols, we show an attack on the Sako-Kilian election scheme presented at CRYPTO 94 made possible by the protocol failure on achieving independence. Using our techniques we will show how to modify the scheme to make it secure.
منابع مشابه
Using non-interactive proofs to achieve independence e ciently and securely
Independence or simultaneous broadcast is a fundamental tool to achieve security in fault tolerant distributed computing. It allows n players to commit to independently chosen values. In this paper we present a constant round protocol to perform this task. Previous solutions were all O(logn) rounds. In the process we develop a new and stronger formal de nition from this problem. As an example o...
متن کاملAchieving Independence Eeciently and Securely
Independence or simultaneous broadcast is a fundamental tool to achieve security in fault tolerant distributed computing. It allows n players to commit to independently chosen values. In this paper we present a constant round protocol to perform this task under general complexity assumptions. Previous solutions were all O(log n) rounds. In the process we develop a new and stronger formal deenit...
متن کاملAn Eecient Non-interactive Statistical Zero-knowledge Proof System for Quasi-safe Prime Products
We present eecient zero-knowledge proof systems for quasi-safe prime products and other related languages. Quasi-safe primes are a relaxation of safe primes, a class of prime numbers useful in many cryptographic applications. Our proof systems achieve higher security and better eeciency than all previously known ones. In particular, all our proof systems are perfect or statistical zero-knowledg...
متن کاملStrategic confrontation within monetary and financial authorities, and foreign exchange market participants in Iran: non-cooperative static games approach
The experience of large fluctuations in the Foreign Exchange Market in Iran and the impact of monetary and fiscal policies on this market revealed the importance of adopting a scientific approach by fiscal and monetary policymakers and paying attention to the behavior of other actors (Foreign Exchange Speculators) in the decision-making. The present study tries to evaluate the Social Loss of ad...
متن کاملMinimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interactive zero-knowledge proofs of membership exist for all languages in NP. However, known non-interactive zero-knowledge proofs of membership of NP-languages yield proofs that are larger than the corre...
متن کامل